Subtypes for Speci cations ?
نویسنده
چکیده
Speciication languages are best used in environments that provide eeective theorem proving. Having such support available, it is feasible to contemplate forms of typechecking that can use the services of a theorem prover. This allows interesting extensions to the type systems provided for speciication languages. I describe one such extension called \predicate subtyping" and illustrate its utility as mechanized in PVS.
منابع مشابه
Typed Homomorphic Relations Extended with Subtypes
Typed homomorphic relations on heterogeneous algebras are generalized to allow relationships between elements in the carrier sets of di erent types. Such relations are needed for the model theory of incomplete, hierarchical speci cations with subtypes. Typed logical relations are generalized similarly. These tools help give a simple model-theoretic account of subtyping among abstract data types...
متن کاملSubtypes for Speci cations : Predicate
|A speciication language used in the context of an eeective theorem prover can provide novel features that enhance precision and expressiveness. In particular, type-checking for the language can exploit the services of the theorem prover. We describe a feature called \predicate subtyping" that uses this capability and illustrate its utility as mechanized in PVS.
متن کاملBehavioral Subtyping Using Invariants and Constraints
We present a way of de ning the subtype relation that ensures that subtype objects preserve behavioral properties of their supertypes. The subtype relation is based on the speci cations of the suband supertypes. Our approach handles mutable types and allows subtypes to have more methods than their supertypes. Dealing with mutable types and subtypes that extend their supertypes has surprising co...
متن کاملComplexity of hierarchically and 1-dimensional periodically specified problems I: Hardness results
We study the complexity of various combinatorial problems when instances are speci ed using one of the following succinct speci cations: (1) the 1-dimensional nite periodic narrow speci cations (denoted 1-FPN-speci cations) of Ford et al. and Wanke [FF58, Wa93]; (2) the 1-dimensional nite periodic narrow speci cations with explicit boundary conditions (denoted 1-FPN(BC)-speci cations) of Gale [...
متن کاملSpeci cation and Re nement of Finite Data ow Networks a Relational Approach
We specify the black box behavior of data ow components by characterizing the relation between the input and the output histories We distinguish between three main classes of such speci cations namely time independent speci cations weakly time dependent speci cations and strongly time dependent speci cations Data ow components are semantically modeled by sets of timed stream processing function...
متن کامل